0.00/0.00	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.00	% app-encoded or not : original
0.00/0.00	% Variant    : fo
0.00/0.00	% Ordering    : rpo6
0.00/0.00	% Command    : 
0.00/0.00	#!/bin/sh
0.00/0.00	
0.00/0.00	./zipperposition.native ${1:+"$1"} \
0.00/0.00	  -i tptp \
0.00/0.00	  -o tptp \
0.00/0.00	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.00	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.00	  --no-ho \
0.00/0.00	  --no-avatar \
0.00/0.00	  --no-induction \
0.00/0.00	  --no-unif-pattern \
0.00/0.00	  --ord $2 \
0.00/0.00	  --simultaneous-sup false \
0.00/0.00	  --no-max-vars \
0.00/0.00	  --no-fool
0.00/0.19	% Computer   : n189.star.cs.uiowa.edu
0.00/0.19	% Model      : x86_64 x86_64
0.00/0.19	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.19	% Memory     : 32218.625MB
0.00/0.19	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.19	% CPULimit   : 300
0.00/0.19	% DateTime   : Fri Feb  2 17:11:10 CST 2018
0.00/0.20	% done 17 iterations in 0.006s
0.00/0.20	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.20	% SZS output start Refutation
0.00/0.21	tff(setext, axiom,
0.00/0.21	  (setext <=>
0.00/0.21	   (![A,B]:
0.00/0.21	      ((![Xx]: (in(Xx,A) => in(Xx,B))) =>
0.00/0.21	       ((![Xx]: (in(Xx,B) => in(Xx,A))) => (A = B)))))).
0.00/0.21	tff('0', plain,
0.00/0.21	    ![X2, X3]:
0.00/0.21	      (in(sk_Xx2(X2, X3), X3) | X3 = X2 | in(sk_Xx1(X2, X3), X2) | ~ setext),
0.00/0.21	    inference('cnf', [status(esa)], [setext])).
0.00/0.21	tff(emptyI, conjecture,
0.00/0.21	  (emptysetE => (setext => (![A]: ((![Xx]: (~in(Xx,A))) => (A = emptyset)))))).
0.00/0.21	tff(zf_stmt_0, negated_conjecture,
0.00/0.21	  (~
0.00/0.21	    (emptysetE =>
0.00/0.21	     (setext => (![A]: ((![Xx]: (~in(Xx,A))) => (A = emptyset))))))).
0.00/0.21	tff('1', plain, setext, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('2', plain,
0.00/0.21	    ![X2, X3]:
0.00/0.21	      (in(sk_Xx2(X2, X3), X3) | X3 = X2 | in(sk_Xx1(X2, X3), X2) | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['0', '1'])).
0.00/0.21	tff('3', plain,
0.00/0.21	    ![X2, X3]: (in(sk_Xx1(X2, X3), X2) | X3 = X2 | in(sk_Xx2(X2, X3), X3)),
0.00/0.21	    inference('simplify', [status(thm)], ['2'])).
0.00/0.21	tff('4', plain, ![X6]: ~ in(X6, sk_A1),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('5', plain, ![X0]: (~ $true | sk_A1 = X0 | in(sk_Xx1(X0, sk_A1), X0)),
0.00/0.21	    inference('sup-', [status(thm)], ['3', '4'])).
0.00/0.21	tff('6', plain, ![X0]: (in(sk_Xx1(X0, sk_A1), X0) | sk_A1 = X0),
0.00/0.21	    inference('simplify', [status(thm)], ['5'])).
0.00/0.21	tff(emptysetE, axiom,
0.00/0.21	  (emptysetE <=> (![Xx]: (in(Xx,emptyset) => (![Xphi:$o]: Xphi))))).
0.00/0.21	tff('7', plain, ![X0, X1 : $o]: (~ in(X0, emptyset) | X1 | ~ emptysetE),
0.00/0.21	    inference('cnf', [status(esa)], [emptysetE])).
0.00/0.21	tff('8', plain, emptysetE, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('9', plain, ![X0, X1 : $o]: (~ in(X0, emptyset) | X1 | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['7', '8'])).
0.00/0.21	tff('10', plain, ![X0, X1 : $o]: (X1 | ~ in(X0, emptyset)),
0.00/0.21	    inference('simplify', [status(thm)], ['9'])).
0.00/0.21	tff('11', plain, ![X0 : $o]: (~ $true | sk_A1 = emptyset | X0),
0.00/0.21	    inference('sup-', [status(thm)], ['6', '10'])).
0.00/0.21	tff('12', plain, ![X0 : $o]: (X0 | sk_A1 = emptyset),
0.00/0.21	    inference('simplify', [status(thm)], ['11'])).
0.00/0.21	tff('13', plain, sk_A1 != emptyset,
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('14', plain, ![X0 : $o]: X0,
0.00/0.21	    inference('simplify_reflect-', [status(thm)], ['12', '13'])).
0.00/0.21	tff('15', plain, ~ $true, inference('sup-', [status(thm)], ['14', '4'])).
0.00/0.21	tff('16', plain, $false, inference('simplify', [status(thm)], ['15'])).
0.00/0.21	
0.00/0.21	% SZS output end Refutation
0.00/0.21	EOF
